Gossiping Large Packets on Full-Port Tori
نویسندگان
چکیده
Near-optimal gossiping algorithms are given for two-and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For two-dimensional tori, an earlier algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In our algorithms, in all steps, the PUs forward the received packets in the same way.
منابع مشابه
Time-Independent Gossiping on Full-Port Tori
Near-optimal gossiping algorithms are given for twoand higher dimensional tori. It is assumed that the amount of data each PU contributes is so large that start-up time may be neglected. For twodimensional tori, a previous algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In all steps of our algorithms, the PUs forward the received packets in the same way.
متن کاملOblivious Gossiping on Tori
Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern. In contrast, the processing units in our algorithm forward the received packets always in the same way. We thus achieve ...
متن کاملGossiping in Cayley Graphs by Packets
Gossiping (also called total exchange or all-to-all communication) is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider here gossiping in the store-and-forward, full-duplex and-port (or shouting) model. In such a model, the protocol consists of a sequence of rounds and during each round, ea...
متن کاملFast Gossiping in Square Meshes/Tori with Bounded-Size Packets
ÐGossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets (each carrying exactly one token) are used, the links (edg...
متن کاملNeighbourhood Gossiping in Hypercubes
In the neighbourhood gossiping problem, each node of a network starts with a unique message and must learn the messages of all of its neighbours. In this paper, we prove upper and lower bounds for neighbourhood gossiping in hypercubes under the single-port half-duplex and single-port full-duplex communication models.
متن کامل